and L . Fribourg and C . Picaronny Randomized Dining Philosophers Without Fairness Assumption

The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers

The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers. (December 2008) Yantao Song, B.S., Beijing Institute of Technology; M.S., Chinese Academy of Sciences Chair of Advisory Committee: Dr. Scott M. Pike This dissertation explores the necessary and sufficient conditions to solve a variant of the dining philosophers problem. This dining variant is define...

Fairneß, Randomisierung und Konspiration in verteilten Algorithmen

Fairness, Randomization, and Conspiracy in Distributed Algorithms Concepts such as fairness (i.e., fair con ict resolution), randomization (i.e., coin ips), and partial synchrony are frequently used to solve fundamental synchronizationand coordination-problems in distributed systems such as the mutual exclusion problem (mutex problem for short) and the consensus problem. For some problems it is...

Progress with Java threads as dining philosophers

The classical problem of the dining philosphers is solved and implemented with Java threads, without central coordination. Apart from the initialization the program is symmetric. The philosophers are the synchronized objects whereas the forks between the philosophers are unsynchronized. It is proved that every hungry philosopher eats within bounded delay, in a certain formalized sense.

On the Time Complexity of the Dining Philosophers Problem

Randomized Distributed Algorithms As Markov Chains

Distributed randomized algorithms, when they operate under a memoryless scheduler, behave as finite Markov chains: the probability at n-th step to go from a configuration x to another one y is a constant p that depends on x and y only. By Markov theory, we thus know that, no matter where the algorithm starts, the probability for the algorithm to be after n steps in a “recurrent” configuration t...